Multiobjective GRASP with Path Relinking
نویسندگان
چکیده
In this paper we propose an adaptation of the GRASP metaheuristic to solve multi-objective combinatorial optimization problems. In particular we describe several alternatives to specialize the construction and improvement components of GRASP when two or more objectives are considered. GRASP has been successfully coupled with path-relinking for single-objective optimization. In this paper, we propose different hybridizations of GRASP and path-relinking for multi-objective optimization. We apply the proposed GRASP with path-relinking variants to two combinatorial optimization problems, the bi-objective orienteering problem and the bi-objective path dissimilarity problem. We report on empirical tests with 70 instances that show that the proposed heuristics are competitive with the state-of-the-art methods for these problems.
منابع مشابه
Grasp with Path-relinking: Recent Advances and Applications
Path-relinking is a major enhancement to the basic greedy randomized adaptive search procedure (GRASP), leading to significant improvements in solution time and quality. Path-relinking adds a memory mechanism to GRASP by providing an intensification strategy that explores trajectories connecting GRASP solutions and the best elite solutions previously produced during the search. This paper revie...
متن کاملGrasp with Evolutionary Path-relinking
We propose GRASP with evolutionary path-relinking, a metaheuristic resulting from the hybridization of GRASP, path-relinking, and evolutionary path-relinking. This metaheuristic is applied to a network migration problem. Experiments show that a GRASP with evolutionary path-relinking heuristic finds solutions faster than a heuristic based on GRASP with path-relinking as well as one based on pure...
متن کاملGrasp with Path Relinking for the Three-index Assignment Problem
Abstract. This paper describes variants of GRASP (greedy randomized adaptive search procedure) with path relinking for the three index assignment problem (AP3). GRASP is a multi-start metaheuristic for combinatorial optimization. It usually consists of a construction procedure based on a greedy randomized algorithm and of a local search. Path relinking is an intensification strategy that explor...
متن کاملGRASP with Path Relinking for Three-Index Assignment
T paper proposes and tests variants of GRASP (greedy randomized adaptive search procedure) with path relinking for the three-index assignment problem (AP3). GRASP is a multistart metaheuristic for combinatorial optimization. It usually consists of a construction procedure based on a greedy randomized algorithm and of a local search. Path relinking is an intensification strategy that explores tr...
متن کاملHybridizations of GRASP with Path-Relinking
A greedy randomized adaptive search procedure (GRASP) is a metaheuristic for combinatorial optimization. GRASP heuristics are multistart procedures which apply local search to a set of starting solutions generated with a randomized greedy algorithm or semi-greedy method. The best local optimum found over the iterations is returned as the heuristic solution. Path-relinking is a search intensific...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- European Journal of Operational Research
دوره 240 شماره
صفحات -
تاریخ انتشار 2015